Euclidean algorithm

noun

: a method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor

called also Euclid's algorithm

Word History

First Known Use

circa 1955, in the meaning defined above